The equivalence problem for deterministic MSO tree transducers is decidable
نویسندگان
چکیده
منابع مشابه
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
It is decidable for deterministic MSO definable graph-to-string or graphto-tree transducers whether they are equivalent on a context-free set of graphs. It is well known that the equivalence problem for nondeterministic (one-way) finite state transducers is undecidable, even when they cannot read or write the empty string [Gri68]. In contrast, equivalence is decidable for deterministic finite s...
متن کاملMacro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
A characterization is given of the class of tree translations definable in monadic second-order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs) with regular look-ahead that are single use restricted. For this the single use restriction known from attri...
متن کاملSingle-Valuedness of Tree Transducers is Decidable in Polynomial Time
Seidl, H., Single-valuedness of tree transducers is decidable in polynomial time, Theoretical Computer Science 106 (1992) 135-181. A bottom-up finite-state tree transducer (FST) A is called single-valued iff for every input tree there is at most one output tree. We give a polynomial-time algorithm which decides whether or not a given FST is single-valued. The algorithm is based on: . the freedo...
متن کاملThe Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable
Letter-to-letter bottom-up tree transducers are investigated in this paper. With an encoding of the so deened tree transformations into relabelings, we establish the decidability of equivalence for this class of tree transducers. Some extensions are next given.
متن کاملEquivalence of Symbolic Tree Transducers
Symbolic tree transducers are programs that transform data trees with an infinite signature. In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop. As a consequence the equivalence of two symbolic DTop can be decided in NExpTime, when assuming that all operations related to the processing of data v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2006
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.05.015